Ad-a017 935 Capsule View of Future Developments on Large Scale Network and Network-related Problems
نویسندگان
چکیده
The primary purpose of this paper is to identify recent major accomplishments and prophesy (suggest) future trends in the solution, modeling, and human engineering aspects of network and network-related problems. In particular, the suggested future trends consist of an integrated sequence of modeling, theoretical and computational developments which may allow mathematical programming to attain its envisioned goal of being a major vehicle for solving pressing industrial and world problems. Network and network-related problems include such inathematical problems as assignment, transportation, transshipment, multi-commodity networks, generalized networks, set covering and partitioning problems, matroicl problems, plant location problems, fixed charge networks, constrained networks, general linear programs with GUB and network substructure, constrained spanning tree problems, traveling salesman problems, and combinations of these. In fact, it hafj recently been shown that any 0-1 integer programming problems are equivalent to 0-1 generalized network problems. Network-related problems that arise "naturally" (i.e., those whose formulations make conspicuous reference to a network structure) cover a diverse spectrum of practical applications. These applications include problems in telecommunication, microdata set merging, cash flow,
منابع مشابه
Improved Binary Particle Swarm Optimization Based TNEP Considering Network Losses, Voltage Level, and Uncertainty in Demand
Transmission network expansion planning (TNEP) is an important component of power system planning. Itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. Different methods have been proposed for the solution of the static transmissionnetwork expansion planning (STNEP) problem till now. But in all of them, STNEP pr...
متن کاملاستفاده از خوشه بندی در پروتکل مسیریابی AODV برای شبکه های بین خودرویی بر روی سناریوی بزرگراه
Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network are considered as a big challenge For routing in these networks, routing protocols must be robust and reliable. AODV Routing pr...
متن کاملEstimating Reliability in Mobile ad-hoc Networks Based on Monte Carlo Simulation (TECHNICAL NOTE)
Each system has its own definition of reliability. Reliability in mobile ad-hoc networks (MANET) could be interpreted as, the probability of reaching a message from a source node to destination, successfully. The variability and volatility of the MANET configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate. It is because, no single structure or configurat...
متن کاملAN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کامل